A Short Proof of Representability of Fork Algebras

نویسنده

  • Viktor Gyuris
چکیده

In this paper a strong relation is demonstrated between fork algebras and quasi-projective relation algebras. With the help of the representation theorem of quasi-projective relation algebras, a short proof is given for the representation theorem of fork algebras. Fork algebras, due to their expressive power and applicability in computing science, have been intensively studied in the last four years. Their literature is alive and productive. See e. in algebra, there are two kinds of representation theorems: strong and weak representation. For fork algebras strong representation was proved impossible in 15], 17], 16]. However, weak representation is still possible and is quite useful (e.g. 1]). The distinction between the two kinds of representation is not absolutely necessary for understanding the main contribution of this paper, therefore we postpone the description of this distinction to remark 0.10 at the end of the paper. In the main bulk of the paper we concentrate on weak representation. Hence for brevity, we often write representation instead of weak representation, hoping that context will help. Several papers concentrate on giving a proof or an outline of proof for weak repre-sentability of fork algebras (e.g. 1], 2], 8]). The contribution of the present note is threefold. (i) We provide a very short and easy proof for this representation theorem. (ii) We generalize the representation theorem to a much broader class called pre-fork algebras from the originally discussed narrower class in 1]. Originally, fork algebras did not form an equational class and their axiomatization involved a quite complicated formula not equivalent to any equation or even quasi-equation. The new pre-fork algebras admit a simple equational axiomatization, and contain all thèold' fork algebras. It seems that in their latest paper Baum, Frias, Haeberer and LL opez adopt the wider class we call here pre-fork algebras as the central topic of study cf. 1]. (iii) We elaborate the connection between the recent theory of fork algebras and Tarski's theory of pairing relation algebras which is a classical branch of algebraic logic going back to 1949 20, p. 168]. For historical reasons we will use the 791

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Representability and Program Construction within Fork Algebras

The representation theorem for fork algebras was always misunderstood regarding its applications in program construction. Its application was always described as “the portability of properties of the problem domain into the abstract calculus of fork algebras”. In this paper we show that the results provided by the representation theorem are by far more important. We show that not only the heuri...

متن کامل

Representability of Pairing Relation Algebras Depends on your Ontology

We consider classes of relation algebras expanded with new operations based on the formation of ordered pairs. Examples for such algebras are pairing (or projection) algebras of algebraic logic and fork algebras of computer science. It is proved in Sain{N emeti 36] that there is nòstrong' representation theorem for all abstract pairing algebras in most set theories including ZFC as well as most...

متن کامل

The Representation of Boolean Algebras in the Spotlight of a Proof Checker

We report on a proof-checked version of Stone’s result on the representability of Boolean algebras via the clopen sets of a totally disconnected compact Hausdor↵ space. Our experiment is based on a proof verifier based on set theory, whose usability can in its turn benefit from fully formalized proofs of representation theorems akin to the one discussed in this note.

متن کامل

Squares in Fork Arrow Logic

In this paper we show that the class of fork squares has a complete orthodox axiomatization in fork arrow logic (FAL). This result may be seen as an orthodox counterpart of Venema’s non-orthodox axiomatization for the class of squares in arrow logic. FAL is the modal logic of fork algebras (FAs) just as arrow logic is the modal logic of relation algebras (RAs). FAs extend RAs by a binary fork o...

متن کامل

Notions of Density That Imply Representability in Algebraic Logic

Henkin and Tarski proved that an atomic cylindric algebra in which every atom is a rectangle must be representable (as a cylindric set algebra). This theorem and its analogues for quasi-polyadic algebras with and without equality are formulated in Henkin-Monk-Tarski 1985]. We introduce a natural and more general notion of rectangular density that can be applied to arbitrary cylindric and quasi-...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Theor. Comput. Sci.

دوره 188  شماره 

صفحات  -

تاریخ انتشار 1995